A Family of Convexity-Preserving Subdivision Schemes
نویسندگان
چکیده
A new five-point binary subdivision scheme with high continuity and convexity preservation is proposed in this paper. It is shown that the limit curves are C (k = 0, 1, . . . , 7) continuous for the certain range of the parameter. The range of the parameter for the property of convexity preservation of the limit curves is also provided. Experimental results demonstrate the efficiency and flexibility of the scheme.
منابع مشابه
Shape Preserving C2 Interpolatory Subdivision Schemes
Stationary interpolatory subdivision schemes which preserve shape properties such as convexity or monotonicity are constructed. The schemes are rational in the data and generate limit functions that are at least C 2. The emphasis is on a class of six-point convexity preserving subdivision schemes that generate C 2 limit functions. In addition, a class of six-point monotonicity preserving scheme...
متن کاملHermite-interpolatory subdivision schemes
Stationary interpolatory subdivision schemes for Hermite data that consist of function values and first derivatives are examined. A general class of Hermite-interpolatory subdivision schemes is proposed, and some of its basic properties are stated. The goal is to characterise and construct certain classes of nonlinear (and linear) Hermite schemes. For linear Hermite subdivision, smoothness cond...
متن کاملHow Data Dependent is a Nonlinear Subdivision Scheme? A Case Study Based on Convexity Preserving Subdivision
The regularity of the limit function of a linear subdivision scheme is essentially irrelevant to the initial data. How data dependent, then, is the regularity of the limit of a nonlinear subdivision scheme? The answer is the most obvious it depends. In this paper, we prove that the nonlinear convexity preserving subdivision scheme developed independently by Floater/Micchelli [12] and Kuijt/van ...
متن کاملdi Milano – Bicocca Quaderni di Matematica Convexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in G limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method.
متن کاملConvexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm reproducing conic sections and respecting the convexity properties of the initial data, is here presented. Significant numerical examples are included to illustrate the effectiveness of the proposed method and the smoothne...
متن کامل